Symbolic Bisimulation Minimisation
نویسندگان
چکیده
We adapt the Coarsest Partition Reenement algorithm to its computation using the speciic data structures of Binary Decision Diagrams. This allows to generate symbolically the set of equivalence classes of a nite automaton with respect to bisim-ulation, without constructing the automaton itself. These equivalence classes represent of course the (new) states of the canonical minimal automaton bisimilar to the early one. The method works from labeled synchronised vectors of automata as the distributed system description. We report on performances of Hoggar, a tool implementing our method.
منابع مشابه
Finite-Horizon Bisimulation Minimisation for Probabilistic Systems
We present model reduction techniques to improve the efficiency and scalability of verifying probabilistic systems over a finite time horizon. We propose a finite-horizon variant of probabilistic bisimulation for discrete-time Markov chains, which preserves a bounded fragment of the temporal logic PCTL. In addition to a standard partitionrefinement based minimisation algorithm, we present on-th...
متن کاملBisimulation Minimisation and Probabilistic Model Checking
Probabilistic model checking is a technique for the verification of probabilistic systems. The size of the state space is a limiting factor for model checking. We used bisimulation minimisation to combat this problem. Bisimulation minimisation is a technique where the model under consideration is first minimised prior to the actual model checking. We also considered a technique where the model ...
متن کاملBackward and Forward Bisimulation Minimisation of Tree Automata
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Minimisation via forward bisimulation is also effective for deterministic automata and faster than the previous algorithm. Minimisation via backward bisimulation generalises the previous algorithm and is thus more effecti...
متن کاملTechnique and Tool for Symbolic Representation and Manipulation of Stochastic Transition Systems
We present a new approach to the compact symbolic representation of stochastic transition systems, based on Decision Node BDDs, a novel stochastic extension of BDDs. Parallel composition of components can be performed on the basis of this new data structure. We also discuss symbolic state space reduction by Markovian bisimulation. In many areas of system design and analysis, there is the proble...
متن کاملSMT-Based Bisimulation Minimisation of Markov Models
Probabilistic model checking is an increasingly widely used formal verification technique. However, its dependence on computationally expensive numerical operations makes it particularly susceptible to the state-space explosion problem. Among other abstraction techniques, bisimulation minimisation has proven to shorten computation times significantly, but, usually, the full state space needs to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992